SZEMERÉDI, ENDRE: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

A note on Ramsey numbers

Miklós Ajtai, János Komlós, Endre Szemerédi

Journal:

Journal of Combinatorial Theory, Series A

Year:

1980

Language:

english

File:

PDF, 310 KB

english, 1980

2

Storing a Sparse Table with 0(1) Worst Case Access Time

Fredman, Michael L., Komlós, János, Szemerédi, Endre

Journal:

Journal of the ACM

Year:

1984

Language:

english

File:

PDF, 348 KB

english, 1984

3

Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes

Pintz, Janos, Steiger, William L., Szemeredi, Endre

Journal:

Mathematics of Computation

Year:

1989

Language:

english

File:

PDF, 1.05 MB

english, 1989

4

On the Probability That a Random ± 1-Matrix Is Singular

Jeff Kahn, János Komlós and Endre Szemerédi

Journal:

Journal of the American Mathematical Society

Year:

1995

Language:

english

File:

PDF, 1.10 MB

english, 1995

5

A Dense Infinite Sidon Sequence

Ajtai, Miklós, Komlós, János, Szemerédi, Endre

Journal:

European Journal of Combinatorics

Year:

1981

Language:

english

File:

PDF, 500 KB

english, 1981

6

On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape turing machines

Zvi Galil, Ravi Kannan, Endre Szemerédi

Journal:

Journal of Computer and System Sciences

Year:

1989

Language:

english

File:

PDF, 1.05 MB

english, 1989

7

Spanning Trees in Dense Graphs

KOMLÓS, JÁNOS, SÁRKÓZY, GÁBOR N., SZEMERÉDI, ENDRE

Journal:

Combinatorics Probability & Computing

Year:

2001

Language:

english

File:

PDF, 260 KB

english, 2001

8

Short paths in quasi-random triple systems with sparse underlying graphs

Joanna Polcyn, Vojtech Rödl, Andrzej Ruciński, Endre Szemerédi

Journal:

Journal of Combinatorial Theory, Series B

Year:

2006

Language:

english

File:

PDF, 257 KB

english, 2006

9

Arithmetic Progressions, Different Regularity Lemmas and Removal Lemmas

Szemerédi, Endre

Journal:

Communications in Mathematics and Statistics

Year:

2015

Language:

english

File:

PDF, 644 KB

english, 2015

10

The analysis of double hashing

Leo J. Guibas, Endre Szemeredi

Journal:

Journal of Computer and System Sciences

Year:

1978

Language:

english

File:

PDF, 2.79 MB

english, 1978

11

Many hard examples for resolution

Chvátal, Vašek, Szemerédi, Endre

Journal:

Journal of the ACM

Year:

1988

Language:

english

File:

PDF, 636 KB

english, 1988

12

Dirac-type conditions for hamiltonian paths and cycles in 3-uniform hypergraphs

Vojtech Rödl, Andrzej Ruciński, Endre Szemerédi

Journal:

Advances in Mathematics

Year:

2011

Language:

english

File:

PDF, 897 KB

english, 2011

13

Sparse partition universal graphs for graphs of bounded degree

Yoshiharu Kohayakawa, Vojtěch Rödl, Mathias Schacht, Endre Szemerédi

Journal:

Advances in Mathematics

Year:

2011

Language:

english

File:

PDF, 240 KB

english, 2011

14

[IEEE 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - Tucson, AZ, USA (1983.11.7-1983.11.9)] 24th Annual Symposium on Foundations of Computer Science (sfcs 1983) - On determinism versus non-determinism and related problems

Paul, Wolfgang J., Pippenger, Nicholas, Szemeredi, Endre, Trotter, William T.

Year:

1983

Language:

english

File:

PDF, 821 KB

english, 1983

15

A fast algorithm for equitable coloring

Henry A. Kierstead, Alexandr V. Kostochka, Marcelo Mydlarz, Endre Szemerédi

Journal:

Year:

2010

Language:

english

File:

PDF, 399 KB

english, 2010

16

There are no p-complete families of symmetric boolean functions

Mihály Geréb-Graus, Ramamohan Paturi, Endre Szemerédi

Journal:

Information Processing Letters

Year:

1989

Language:

english

File:

PDF, 279 KB

english, 1989

17

[ACM Press the twentieth annual ACM symposium - Chicago, Illinois, United States (1988.05.02-1988.05.04)] Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 - Two infinite sets of primes with fast primality tests

Pintz, János, Steiger, William, Szemerédi, Endre

Year:

1988

Language:

english

File:

PDF, 476 KB

english, 1988

18

Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

Journal:

Graphs and Combinatorics

Year:

2010

Language:

english

File:

PDF, 124 KB

english, 2010

19

The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition

Hladký, Jan, Komlós, János, Piguet, Diana, Simonovits, Miklós, Stein, Maya, Szemerédi, Endre

Journal:

SIAM Journal on Discrete Mathematics

Year:

2017

Language:

english

File:

PDF, 860 KB

english, 2017

20

Girth of sparse graphs

Béla Bollobás, Endre Szemerédi

Journal:

Journal of Graph Theory

Year:

2002

Language:

english

File:

PDF, 73 KB

english, 2002

21

Proof of the Alon–Yuster conjecture

János Komlós, Gábor Sárközy, Endre Szemerédi

Journal:

Discrete Mathematics

Year:

2001

Language:

english

File:

PDF, 137 KB

english, 2001

22

The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs

Hladký, Jan, Komlós, János, Piguet, Diana, Simonovits, Miklós, Stein, Maya, Szemerédi, Endre

Journal:

SIAM Journal on Discrete Mathematics

Year:

2017

Language:

english

File:

PDF, 823 KB

english, 2017

23

Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

Journal:

Journal of Graph Theory

Year:

2010

Language:

english

File:

PDF, 122 KB

english, 2010

24

The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs

Hladký, Jan, Komlós, János, Piguet, Diana, Simonovits, Miklós, Stein, Maya, Szemerédi, Endre

Journal:

SIAM Journal on Discrete Mathematics

Year:

2017

Language:

english

File:

PDF, 1.09 MB

english, 2017

25

Perfect matchings in large uniform hypergraphs with large minimum collective degree

Vojtech Rödl, Andrzej Ruciński, Endre Szemerédi

Journal:

Journal of Combinatorial Theory, Series A

Year:

2009

Language:

english

File:

PDF, 386 KB

english, 2009

26

Three-Color Ramsey Numbers For Paths

András Gyárfás, Miklós Ruszinkó*, Gábor N. Sárközy†, Endre Szemerédi

Journal:

Year:

2007

Language:

english

File:

PDF, 450 KB

english, 2007

27

[ACM Press the twenty-seventh annual ACM symposium - Las Vegas, Nevada, United States (1995.05.29-1995.06.01)] Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 - Lower bounds for sorting networks

Kahale, Nabil, Leighton, Tom, Ma, Yuan, Plaxton, C. Greg, Suel, Torsten, Szemerédi, Endre

Year:

1995

Language:

english

File:

PDF, 992 KB

english, 1995

28

Topological cliques in graphs II

Komlós, János, Szemerédi, Endre

Journal:

Combinatorics Probability & Computing

Year:

1996

Language:

english

File:

PDF, 523 KB

english, 1996

29

Topological Cliques in Graphs

komlós, János, Szemerédi, Endre

Journal:

Combinatorics Probability & Computing

Year:

1994

Language:

english

File:

PDF, 443 KB

english, 1994

30

Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles

ŁUCZAK, TOMASZ, RÖDL, VOJTĚCH, SZEMERÉDI, ENDRE

Journal:

Combinatorics Probability & Computing

Year:

1998

Language:

english

File:

PDF, 236 KB

english, 1998

31

The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result

Hladký, Jan, Komlós, János, Piguet, Diana, Simonovits, Miklós, Stein, Maya, Szemerédi, Endre

Journal:

SIAM Journal on Discrete Mathematics

Year:

2017

Language:

english

File:

PDF, 1.51 MB

english, 2017

32

An upper bound on the number of planarK-sets

János Pach, William Steiger, Endre Szemerédi

Journal:

Discrete & Computational Geometry

Year:

1992

Language:

english

File:

PDF, 746 KB

english, 1992

33

On Size Ramsey Numbers of Graphs with Bounded Degree

Vojtěch Rödl, Endre Szemerédi

Journal:

Year:

2000

Language:

english

File:

PDF, 144 KB

english, 2000

34

Matching Nuts and Bolts in O(n log n) Time

Komlós, János, Ma, Yuan, Szemerédi, Endre

Journal:

SIAM Journal on Discrete Mathematics

Year:

1998

Language:

english

File:

PDF, 454 KB

english, 1998

35

A Dirac-Type Theorem for 3-Uniform Hypergraphs

RÖDL, VOJTECH, RUCINSKI, ANDRZEJ, SZEMERÉDI, ENDRE

Journal:

Combinatorics Probability & Computing

Year:

2006

Language:

english

File:

PDF, 371 KB

english, 2006

36

Monochromatic Matchings in the Shadow Graph of Almost Complete Hypergraphs

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

Journal:

Annals of Combinatorics

Year:

2010

Language:

english

File:

PDF, 190 KB

english, 2010

37

On the Hamiltonicity of Triple Systems with High Minimum Degree

Vojtěch Rödl,Andrzej Ruciński,Mathias Schacht,Endre Szemerédi

Journal:

Annals of Combinatorics

Year:

2017

Language:

english

File:

PDF, 1.49 MB

english, 2017

38

Perfect matchings in uniform hypergraphs with large minimum degree

Vojtech Rödl, Andrzej Ruciński, Endre Szemerédi

Journal:

European Journal of Combinatorics

Year:

2006

Language:

english

File:

PDF, 435 KB

english, 2006

39

Structural Approach to Subset Sum Problems

Szemerédi, Endre

Journal:

Foundations of Computational Mathematics

Year:

2016

Language:

english

File:

PDF, 586 KB

english, 2016

40

Limit distribution for the existence of hamiltonian cycles in a random graph

János Komlós, Endre Szemerédi

Journal:

Discrete Mathematics

Year:

1983

Language:

english

File:

PDF, 874 KB

english, 1983

41

The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$

Ragde, Prabhakar, Steiger, William, Szemerédi, Endre, Wigderson, Avi

Journal:

SIAM Journal on Discrete Mathematics

Year:

1988

Language:

english

File:

PDF, 1.70 MB

english, 1988

42

Tripartite Ramsey numbers for paths

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi

Journal:

Journal of Graph Theory

Year:

2007

Language:

english

File:

PDF, 137 KB

english, 2007

43

A lower bound for read-once-only branching programs

László Babai, Péter Hajnal, Endre Szemerédi, György Turán

Journal:

Journal of Computer and System Sciences

Year:

1987

Language:

english

File:

PDF, 582 KB

english, 1987

44

An Optimal-Time Algorithm for Slope Selection

Cole, Richard, Salowe, Jeffrey S., Steiger, W. L., Szemerédi, Endre

Journal:

SIAM Journal on Computing

Year:

1989

Language:

english

File:

PDF, 2.49 MB

english, 1989

45

An improved bound for the monochromatic cycle partition number

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi

Journal:

Journal of Combinatorial Theory, Series B

Year:

2006

Language:

english

File:

PDF, 205 KB

english, 2006

46

Three-color Ramsey numbers for paths

András Gyárfás, Miklós Ruszinkó, Gábor N. Sárközy, Endre Szemerédi

Journal:

Year:

2008

Language:

english

File:

PDF, 325 KB

english, 2008

47

A statistical theorem of set addition

Antal Balog, Endre Szemerédi

Journal:

Year:

1994

Language:

english

File:

PDF, 245 KB

english, 1994

48

Limit distribution for the existence of Hamiltonian cycles in a random graph

János Komlós, Endre Szemerédi

Journal:

Discrete Mathematics

Year:

2006

Language:

english

File:

PDF, 172 KB

english, 2006

49

Two tapes versus one for off-line Turing machines

Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán

Journal:

Computational Complexity

Year:

1993

Language:

english

File:

PDF, 603 KB

english, 1993

50

Stability of the path–path Ramsey number

András Gyárfás, Gábor N. Sárközy, Endre Szemerédi

Journal:

Discrete Mathematics

Year:

2009

Language:

english

File:

PDF, 404 KB

english, 2009

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски